Systems of rank one, explicit Rokhlin towers, and covering numbers
نویسندگان
چکیده
Abstract Rotations $$f_\alpha $$ fα of the one-dimensional torus (equipped with normalized Lebesgue measure) by an irrational angle $$\alpha xmlns:mml="http://www.w3.org/1998/Math/MathML">α are known to be dynamical systems rank one. This is equivalent property that covering number $$F^*(f_\alpha )$$ xmlns:mml="http://www.w3.org/1998/Math/MathML">F∗(fα) system In other words, there exists a basis B such for arbitrarily high h , large proportion unit can covered Rokhlin tower $$(f_\alpha ^kB)_{k=0}^{h-1}$$ xmlns:mml="http://www.w3.org/1998/Math/MathML">(fαkB)k=0h-1 . Although chosen diameter smaller than any fixed $$\varepsilon > 0$$ xmlns:mml="http://www.w3.org/1998/Math/MathML">ε>0 it not always possible take interval but this only done when partial quotients unbounded. present paper, we ask what maximum union $$n_B \in {\mathbb {N}}$$ xmlns:mml="http://www.w3.org/1998/Math/MathML">nB∈N disjoint intervals. question has been answered in case =1$$ xmlns:mml="http://www.w3.org/1998/Math/MathML">nB=1 Checkhova, and here address general situation. If = 2$$ xmlns:mml="http://www.w3.org/1998/Math/MathML">nB=2 give precise formula proportion. Furthermore, show converges 1 \rightarrow \infty xmlns:mml="http://www.w3.org/1998/Math/MathML">nB→∞ Explicit lower bounds given if constant quotients. Our approach inspired construction involved proof lemma furthermore makes use three gap theorem.
منابع مشابه
Motzkin Numbers of Higher Rank: Generating Function and Explicit Expression
The classical Motzkin numbers (A001006 in [1]) count the numbers of Motzkin paths (and are also related to many other combinatorial objects, see Stanley [2]). Let us recall the definition of Motzkin paths. We consider in the Cartesian plane Z × Z those lattice paths starting from (0, 0) that use the steps {U,L,D}, where U = (1, 1) is an up-step, L = (1, 0) a level-step and D = (1,−1) a down-ste...
متن کاملExplicit modular towers
We give a general recipe for explicitly constructing asymptotically optimal towers of modular curves such as {X0(l)}n>1. We illustrate the method by giving equations for eight towers with various geometric features. We conclude by observing that such towers are all of a specific recursive form and speculate that perhaps every tower of this form which attains the Drinfeld-Vlăduţ bound is modular...
متن کاملIrreducible Exact Covering Systems and Clique Numbers of Graphs
For each m ≥ 1, we construct a graph G = (V, E) with ω(G) = m such that max i=1,2 ω(ind(Vi)) = m for arbitrary partition V = V1 ∪ V2, where ω(G) is the clique number of G and ind(Vi) is the induced graph of Vi. Using this result, we may show that for each m ≥ 2 there exists an exact m-cover of Z which is not the union of two 1-covers.
متن کاملthe effect of explicit teaching of metacognitive vocabulary learning strategies on recall and retention of idioms
چکیده ندارد.
15 صفحه اولThe Rokhlin property and the tracial topological rank
Let A be a unital separable simple C∗-algebra with TR(A) ≤ 1 and α be an automorphism. We show that if α satisfies the tracially cyclic Rokhlin property then TR(A ⋊α Z) ≤ 1. We also show that whenever A has a unique tracial state and αm is uniformly outer for each m and αr is approximately inner for some r > 0, α satisfies the tracial cyclic Rokhlin property. By applying the classification theo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 2022
ISSN: ['0003-889X', '1420-8938']
DOI: https://doi.org/10.1007/s00013-021-01683-0